Semidefinite Representations and Facial Reduction
نویسندگان
چکیده
In this paper we extend a recent algorithm for solving the sensor network localization problem (SNL ) to include instances with facial reduction to include the intersection of more than two faces. In particular, we continue to exploit the implicit degeneracy in the semidefinite programming (SDP ) relaxation of SNL . This is a preliminary working paper, and is a work in progress.
منابع مشابه
A facial reduction algorithm for finding sparse SOS representations
Facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial ([3]) removes unnecessary monomials for an SOS representation. In this paper, we establish a relationship between a facial reduction algorithm and the elimination method for a sparse SOS polynomial.
متن کاملNoisy Sensor Network Localization using Semidefinite Representations and Facial Reduction
In this paper we extend a recent algorithm for solving the sensor network localization problem (SNL ) to include instances with noisy data. In particular, we continue to exploit the implicit degeneracy in the semidefinite programming (SDP ) relaxation of SNL . An essential step involves finding good initial estimates for a noisy Euclidean distance matrix, EDM , completion problem. After finding...
متن کاملLarge-Scale Manifold Learning by Semidefinite Facial Reduction
The problem of nonlinear dimensionality reduction is often formulated as a semidefinite programming (SDP) problem. However, only SDP problems of limited size can be directly solved directly using current SDP solvers. To overcome this difficulty, we propose a novel SDP formulation for dimensionality reduction based on semidefinite facial reduction that significantly reduces the number of variabl...
متن کاملPartial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
We develop a practical semidefinite programming (SDP) facial reduction procedure that utilizes computationally efficient approximations of the positive semidefinite cone. The proposed method simplifies SDPs with no strictly feasible solution (a frequent output of parsers) by solving a sequence of easier optimization problems and could be a useful pre-processing technique for SDP solvers. We dem...
متن کاملEfficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations
Determination of a protein’s structure can facilitate an understanding of how the structure changes when that protein combines with other proteins or smaller molecules. In this paper we study a semidefinite programming (SDP) relaxation of the (NP-hard) side chain positioning problem (SCP) presented in Chazelle et al. [4]. We show that the Slater constraint qualification (SCQ) fails for the SDP ...
متن کامل